Symmetry Adapted Assur Decompositions

نویسندگان

  • Anthony Nixon
  • Bernd Schulze
  • Adnan Sljoka
  • Walter Whiteley
چکیده

Assur graphs are a tool originally developed by mechanical engineers to decompose mechanisms for simpler analysis and synthesis. Recent work has connected these graphs to strongly directed graphs, and decompositions of the pinned rigidity matrix. Many mechanisms have initial configurations which are symmetric, and other recent work has exploited the orbit matrix as a symmetry adapted form of the rigidity matrix. This paper explores how the decomposition and analysis of symmetric frameworks and their symmetric motions can be supported by the new symmetry adapted tools.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Checking Mobility and Decomposition of Linkages via Pebble Game Algorithm

The decomposition of linkages into Assur graphs (Assur groups) was developed by Leonid Assur in 1914 to decompose a linkage into fundamental minimal components for the analysis and synthesis of the linkages. In the paper, some new results and new methods are introduced for solving problems in mechanisms, bringing in methods from the rigidity theory community. Using these techniques, an investig...

متن کامل

Directed graphs, decompositions, and spatial linkages

The decomposition of a linkage into minimal components is a central tool of analysis and synthesis of linkages. In this paper we prove that every pinned d-isostatic (minimally rigid) graph (grounded linkage) has a unique decomposition into minimal strongly connected components (in the sense of directed graphs), or equivalently intominimal pinned isostatic graphs, which we call d-Assur graphs. W...

متن کامل

The geometry of rank decompositions of matrix multiplication II: $3\times 3$ matrices

This is the second in a series of papers on rank decompositions of the matrix multiplication tensor. We present new rank $23$ decompositions for the $3\times 3$ matrix multiplication tensor $M_{\langle 3\rangle}$. All our decompositions have symmetry groups that include the standard cyclic permutation of factors but otherwise exhibit a range of behavior. One of them has 11 cubes as summands and...

متن کامل

Geometric properties of Assur graphs

In our previous paper, we presented the combinatorial theory for minimal isostatic pinned frameworks Assur graphs which arise in the analysis of mechanical linkages. In this paper we further explore the geometric properties of Assur graphs, with a focus on singular realizations which have static self-stresses. We provide a new geometric characterization of Assur graphs, based on special singula...

متن کامل

Decompositions for Extended Double Symmetry Models in Square Contingency Tables with Ordered Categories

For square contingency tables with ordered categories, Tomizawa (1992) proposed three kinds of double symmetry models, whose each has a structure of both symmetry about the main diagonal and asymmetry about the reverse diagonal of the table. This paper proposes the extensions of those models and gives the decompositions for three kinds of double symmetry models into the extended quasi double sy...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Symmetry

دوره 6  شماره 

صفحات  -

تاریخ انتشار 2014